Token-Weighted Crowdsourcing

Private Weighted Histogram Aggregation in Crowdsourcing

Error Rate Bounds and Iterative Weighted Majority Voting for Crowdsourcing

Crowdsourcing has become an effective and popular tool for human-powered computation to label large datasets. Since the workers can be unreliable, it is common in crowdsourcing to assign multiple workers to one task, and to aggregate the labels in order to obtain results of high quality. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectat...

Token values

laws and have a correct physical description, " writes H. Pattee, at the State University of New York. But despite such statements there is no doubt the field has a lot of ground to cover to avoid inventing new and sometimes unnecessary words or using the same words to mean different things, and redescribing the familiar for no obvious reason. The Introduction to Biosemiotics is not an easy rea...

Schrödinger's token

A common problem when writing compilers for programming languages or little, domain-specific languages is that an input token may have several interpretations, depending on context. Solutions to this problem demand programmer intervention, obfuscate the language’s grammar, and may introduce subtle bugs. We present a technique which is simple and without the above drawbacks—allowing a token to s...

Token Graphs

For a graph G and integer k ≥ 1, we define the token graph Fk(G) to be the graph with vertex set all k-subsets of V (G), where two vertices are adjacent in Fk(G) whenever their symmetric difference is a pair of adjacent vertices in G. Thus vertices of Fk(G) correspond to configurations of k indistinguishable tokens placed at distinct vertices of G, where two configurations are adjacent whenever...